A Geometric View of Partial Order Reduction
نویسندگان
چکیده
منابع مشابه
A Geometric View of Partial Order Reduction
Verifying that a concurrent program satisfies a given property, such as deadlock-freeness, is computationally difficult. Naive exploration techniques are facing the state space explosion problem: they consider an exponential number of interleavings of parallel threads (relative to the program size). Partial order reduction is a standard method to address this difficulty. It is based on the obse...
متن کاملStatic Partial Order Reduction
1 I n t r o d u c t i o n One c o m m o n me thod for dealing with the intrinsically intractable computa t iona l complexi ty of model-checking asynchronous systems is partial order reduction. This reduct ion technique exploits the c o m m o n practice of model ing concurrent events in asynchronous systems as an interleaving of the events in all possible execution orders. An impor t an t observ...
متن کاملCartesian Partial-Order Reduction
Verifying concurrent programs is challenging since the number of thread interleavings that need to be explored can be huge even for moderate programs. We present a cartesian semantics that reduces the amount of nondeterminism in concurrent programs by delaying unnecessary context switches. Using this semantics, we construct a novel dynamic partial-order reduction algorithm. The cartesian semant...
متن کاملApproximate Partial Order Reduction
We develop a partial order reduction method for labeled transition systems over metric spaces. We introduce the notion of ε-independent actions such that executing these actions in any order results in states that are close to each other. Then we define ε-equivalent action sequences that swap ε-independent action pairs. We present an algorithm to over-approximate the reach set of executions tha...
متن کاملPeephole Partial Order Reduction
We present a symbolic dynamic partial order reduction (POR) method for model checking concurrent software. We introduce the notion of guarded independent transitions, i.e., transitions that can be considered as independent in certain (but not necessarily all) execution paths. These can be exploited by using a new peephole reduction method. A symbolic formulation of the proposed peephole reducti...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Notes in Theoretical Computer Science
سال: 2013
ISSN: 1571-0661
DOI: 10.1016/j.entcs.2013.09.013